Threshold cryptography based on Asmuth-Bloom secret sharing

In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present three novel function sharing schemes for RSA, ElGamal and Paillier cryptosystems. To the best of our knowledge, these are the first provably secure threshold cryptosystems realized using the Asmuth-Bloom secret sharing. Proposed schemes are comparable in performance to earlier proposals in threshold cryptography.     

Adaptive flexibility and maladaptive routines in selecting fast and frugal decision strategies.

Decision routines unburden the cognitive capacity of the decision maker. In changing environments, however, routines may become maladaptive. In 2 experiments with a hypothetical stock market game (n = 241), the authors tested whether decision routines tend to persist at the level of decision strategies rather than at the level of options in strategy selection. The payoff structure of the task was changed after 80 decision trials, rendering a new strategy optimal with respect to expected payoff. Whereas most participants detected the appropriate strategy at the beginning of the task, they tended to retain it even when it was no longer optimal. A hint about a possible change had only a small influence on this maladaptive routine; a monetary incentive had none. Switching to a similar but not identical task relaxed the routine, but not much. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

An empirical investigation of socio-cultural factors of information sharing in China

Understanding information sharing is an important challenge to modern organizations, and is likely to be increasingly considered when IT investment decisions are made world-wide. Our research study investigated the influence of cultural factors on information sharing in China. It was postulated that social network structures such as guanxi, Confucian dynamism, and collectivism could explain the degree to which information sharing took place between people in China. It was found that guanxi, Confucian dynamism, and collectivism all had a significant influence on information sharing.     

Seasonal variation in light penetration and subsurface chlorophyll-α in southern Lake Michigan observed by a glider

The Cooperative Institute for Great Lakes Research (CIGLR) in collaboration with the Great Lakes Observing System and National Oceanic and Atmospheric Administration, Great Lakes Environmental Research Laboratory (NOAA GLERL) deployed an autonomous underwater glider in southern Lake Michigan several times per year between 2012 and 2019 to collect offshore (>30 m depth) limnological measurements, including temperature, photosynthetically active radiation (beginning during 2015), and chlorophyll-α fluorescence. From these data, we calculated mixed layer depth, several measures of light penetration (diffuse attenuation coefficient, first optical depth, euphotic zone depth), and depth of the subsurface chlorophyll-α maxima. During summer, mean offshore mixed layer depth was typically 10–15 m, K_d for PAR was 0.1–0.17 m^?1, first optical depth was 6–9 m, euphotic zone depth was 35–40 m, and depth of subsurface chlorophyll-α maxima was 30–35 m. We also observed substantial spatial and temporal variation in these values across the basin and within and among seasons. Glider-based observations provide a wider horizontal and vertical perspective than other methods (e.g., ship- and satellite-based observations, buoys, and fixed moorings), and are therefore a valuable, complementary tool for Great Lakes limnology. The set of observations reported here provide seasonal and basin-scale information that may help to identify anomalies useful for future glider-assisted investigation into the role of biophysical processes in Great Lakes limnology and ecology.     

DETECTOR: A knowledge-based system for injection molding diagnostics

A knowledge-based system (KBS) for diagnosis of multiple defects in injection molding is presented. The general scheme for knowledge representation based on fuzzy set theory has been shown useful in representing inexact and incomplete information for developing the KBS. An optimality criterion is created for selecting a simple and best cover to explain the given problem. An efficient search algorithm for finding such cover is also discussed.     

The Bivariate Transmuted Family of Distributions: Theory and Applications

The bivariate distributions are useful in simultaneous modeling of two random variables. These distributions provide a way to model models. The bivariate families of distributions are not much widely explored and in this article a new family of bivariate distributions is proposed. The new family will extend the univariate transmuted family of distributions and will be helpful in modeling complex joint phenomenon. Statistical properties of the new family of distributions are explored which include marginal and conditional distributions, conditional moments, product and ratio moments, bivariate reliability and bivariate hazard rate functions. The maximum likelihood estimation (MLE) for parameters of the family is also carried out. The proposed bivariate family of distributions is studied for the Weibull baseline distributions giving rise to bivariate transmuted Weibull (BTW) distribution. The new bivariate transmuted Weibull distribution is explored in detail. Statistical properties of the new BTW distribution are studied which include the marginal and conditional distributions, product, ratio and conditional momenst. The hazard rate function of the BTW distribution is obtained. Parameter estimation of the BTW distribution is also done. Finally, real data application of the BTW distribution is given. It is observed that the proposed BTW distribution is a suitable fit for the data used.     

Usable optimistic fair exchange

Fairly exchanging digital content is an everyday problem. It has been shown that fair exchange cannot be achieved without a trusted third party (called the Arbiter). Yet, even with a trusted party, it is still non-trivial to come up with an efficient solution, especially one that can be used in a p2p file sharing system with a high volume of data exchanged.We provide an efficient optimistic fair exchange mechanism for bartering digital files, where receiving a payment in return for a file (buying) is also considered fair. The exchange is optimistic, removing the need for the Arbiter’s involvement unless a dispute occurs. While the previous solutions employ costly cryptographic primitives for every file or block exchanged, our protocol employs them only once per peer, therefore achieving an O(n) efficiency improvement when n blocks are exchanged between two peers. Our protocol uses very efficient cryptography, making it perfectly suitable for a p-2-p file sharing system where tens of peers exchange thousands of blocks and they do not know beforehand which ones they will end up exchanging. Therefore, our system yields up to one-to-two orders of magnitude improvement in terms of both computation and communication (40 s vs. 42 min, 1.6 MB vs. 200 MB). Thus, for the first time, a provably secure (and privacy-respecting when payments are made using e-cash) fair exchange protocol can be used in real bartering applications (e.g., BitTorrent) [14] without sacrificing performance.     

Randomized range-maxima in nearly-constant parallel time

Given an array ofn input numbers, therange-maxima problem is that of preprocessing the data so that queries of the type what is the maximum value in subarray [i..j] can be answered quickly using one processor. We present a randomized preprocessing algorithm that runs inO(log^* n) time with high probability, using an optimal number of processors on a CRCW PRAM; each query can be processed in constant time by one processor. We also present a randomized algorithm for a parallel comparison model. Using an optimal number of processors, the preprocessing algorithm runs inO( (n)) time with high probability; each query can be processed inO ( (n)) time by one processor. (As is standard, (n) is the inverse of Ackermann function.) A constant time query can be achieved by some slowdown in the performance of the preprocessing stage.